A unified solution approach for the due date assignment problem with tardy jobs
نویسنده
چکیده
We analyze a number of due date assignment problems with the weighted number of tardy jobs objective and show that these problems can be solved in O(n) time by dynamic programming. We show that the effects of learning or the effects of past-sequence-dependent setup times can be incorporated into the problem formulation at no additional computational cost. We also show that some single-machine due date assignment problems can be extended to an identical parallel machine setting. Finally, we improve the complexity of the solution algorithms for two other due date assignment problems. & 2011 Elsevier B.V. All rights reserved.
منابع مشابه
A faster algorithm for a due date assignment problem with tardy jobs
Keywords: Single-machine sequencing Weighted number of tardy jobs Due date assignment a b s t r a c t The single-machine due date assignment problem with the weighted number of tardy jobs objective, (the TWNTD problem), and its generalization with resource allocation decisions and controllable job processing times have been solved in O(n 4) time by formulating and solving a series of assignment...
متن کاملSINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملBicriteria models to minimize the total weighted number of tardy jobs with convex controllable processing times and common due date assignment
We study a single-machine scheduling problem in a flexible framework where both job processing times and due dates are decision variables to be determined by the scheduler. The model can also be applied for quoting delivery times when some parts of the jobs may be outsourced. We analyze the problem with common due date assignment and a convex resource consumption function. We provide a bicriter...
متن کاملParallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کاملBatch Scheduling and Common Due Date Assignment Problem: an NP-hard Case
An important special case of the problem studied in Cheng and Kovalyov (1996) arises when there are equal setup times and equal job processing times. Computational complexity of this case was indicated to be open, however. I prove its NP-hardness. Cheng and Kovalyov [l] introduced the following due date assignment and scheduling problem. There are n groups of jobs to be scheduled for processing...
متن کامل